Convex Polytopes: Extremal Constructions and f -Vector Shapes

نویسنده

  • Günter M. Ziegler
چکیده

These lecture notes treat some current aspects of two closely interrelated topics from the theory of convex polytopes: the shapes of f -vectors, and extremal constructions. The study of f -vectors has had huge successes in the last forty years. The most fundamental one is undoubtedly the “g-theorem,” conjectured by McMullen in 1971 and proved by Billera & Lee and Stanley in 1980, which characterizes the f -vectors of simplicial and of simple polytopes combinatorially. See also Section ?? of Forman’s article in this volume, where h-vectors are discussed in connection with the Charney–Davis conjecture. Nevertheless, on some fundamental problems embarassingly little progress was made; one notable such problem concerns the shapes of f -vectors of 4-polytopes. A number of striking and fascinating polytope constructions has been proposed and analyzed over the years. In particular, the Billera–Lee construction produces “all possible f -vectors” of simplicial polytopes. Less visible progress was made outside the range of simple or simplicial polytopes — where our measure of progress is that new polytopes “with interesting f -vectors” should be produced. Thus, still “it seems that overall, we are short of examples. The methods for coming up with

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Face Numbers of 4-Polytopes and 3-Spheres

Steinitz (1906) gave a remarkably simple and explicit description of the set of all f -vectors f(P ) = (f0, f1, f2) of all 3-dimensional convex polytopes. His result also identifies the simple and the simplicial 3-dimensional polytopes as the only extreme cases. Moreover, it can be extended to strongly regular CW 2-spheres (topological objects), and further to Eulerian lattices of length 4 (com...

متن کامل

Extremal Edge Polytopes

The edge polytope of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k ∈ {2, 3, 5}, we determine the maximal number of vertices of kneighborly edge polytopes up to a sublinear term. We also construct a family of edge polytopes with exponentially-many facets.

متن کامل

Geometry of random (-1/+1)-polytopes A survey of recent results on random {−1, 1}-polytopes in Asymptotic Convex Analysis

Random {−1, 1}-polytopes demonstrate extremal behavior with respect to many geometric characteristics.

متن کامل

Investigation of geometric parameters of seawalls on the amount of earth subsidence and its horizontal displacement by FLAC 3D software

Seawalls are built for Protecting of beaches against waves and preventing the progression of water to the beach. For a proper understanding about these constructions, a suiTable information about applied loads on these constructions should be existed. One of the important load that applied on these constructions is sea wave. Others loads are included: weight force of the walls, weight force of ...

متن کامل

Msri-up 2009 Project Topic Ideas

General Background. In [6], [7], J. Hansen introduced these codes using some constructions from algebraic geometry (toric varieties). In somewhat more downto-earth language than he used, let P ⊂ R be an integral convex polytope (the convex hull of some set of integer lattice points). (The book [18] as a good general reference for the geometry of polytopes.) Suppose that P∩Zm is properly contain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005